Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
نویسندگان
چکیده
منابع مشابه
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
In recent years, a new approach has been developed for verifying security protocols with the aim of combining the benefits of symbolic attackers and the benefits of unconditional soundness: the technique of the computationally complete symbolic attacker of Bana and Comon (BC) [6]. In this paper we argue that the real breakthrough of this technique is the recent introduction of its version for i...
متن کاملIndistinguishability and the Computationally Complete Symbolic Attacker ( Extended Abstract )
Recently, we proposed a technique [1] to define a computationally complete symbolic attacker for the verification of security protocols. Such a symbolic attacker can do everything computational attackers can, and hence it is possible to avoid the numerous usual restrictions computational soundness theorems require; in other words, unconditional soundness can be achieved. The main idea is that i...
متن کاملComputationally Complete Symbolic Attacker in Action
We show that the recent technique of computationally complete symbolic attackers proposed by Bana and Comon-Lundh [6] for computationally sound verification of security protocols is powerful enough to verify actual protocols. In their work, Bana and Comon-Lundh presented only the general framework, but they did not introduce sufficiently many axioms to actually prove protocols. We present a set...
متن کاملTowards Unconditional Soundness: Computationally Complete Symbolic Attacker
We consider the question of the adequacy of symbolic models versus computational models for the verification of security protocols. We neither try to include properties in the symbolic model that reflect the properties of the computational primitives nor add computational requirements that enforce the soundness of the symbolic model. We propose in this paper a different approach: everything is ...
متن کاملComputationally Sound Verification of the NSL Protocol via Computationally Complete Symbolic Attacker
In this paper we show that the recent technique of computationally complete symbolic attackers proposed by Bana and Comon-Lundh [7] for computationally sound verification is powerful enough to verify actual protocols, such as the Needham-Schroeder-Lowe Protocol. In their model, one does not define explicit Dolev-Yao adversarial capabilities but rather the limitations (axioms) of the adversarial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2020
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3343508